New Invariants for the Graph Isomorphism Problem
نویسندگان
چکیده
منابع مشابه
New Invariants for the Graph Isomorphism Problem
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the graph instances other wellknown methods could not compute (such as special Fürer Gadgets and point-line incidence graphs of finite projective planes of higher d...
متن کاملCombinatorial invariants for graph isomorphism problem
Presented approach in polynomial time calculates large number of invariants for each vertex, which won’t change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting vertex, what can be though as the diagonal terms of k-th power of the adjacency matrix. For k = 2 we would get degree of verities invariant, higher describes...
متن کاملGraph Invariants and Graph Isomorphism
In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...
متن کاملThe Graph Isomorphism Problem
The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not known to be in P and it is not known to be NP-complete. Many sub-disciplines of mathematics, such as topology theory and group theory, can be brought to bear on the proble...
متن کاملA new ltering algorithm for the graph isomorphism problem
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem may be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less e cient than dedicated algorithms which take advantage of the global semantic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2016
ISSN: 1072-3374,1573-8795
DOI: 10.1007/s10958-016-3061-1